Epi-differentiability and Optimality Conditions for an Extremal Problem under Inclusion Constraints

نویسندگان

  • T. AMAHROQ
  • H. RIAHI
چکیده

In this paper, we establish first-order optimality conditions for the problem of minimizing a function f on the solution set of an inclusion 0 ∈ F (x) where f and the support function of a set-valued mapping F are epi-differentiable at x.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-Level Optimization Problems with Infinite Number of Convex Lower Level Constraints

‎This paper proposes a new form of optimization problem which is a two-level programming problem with infinitely many lower level constraints‎. ‎Firstly‎, ‎we consider some lower level constraint qualifications (CQs) for this problem‎. ‎Then‎, ‎under these CQs‎, ‎we derive formula for estimating the subdifferential of its valued function‎. ‎Finally‎, ‎we present some necessary optimality condit...

متن کامل

The KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings

The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...

متن کامل

Saddle Point Optimality Conditions in Fuzzy Optimization Problems

The Karush–Kuhn–Tucker (KKT) optimality conditions and saddle point optimality conditions in fuzzy programming problems have been studied in literature by various authors under different conditions. In this paper, by considering a partial order relation on the set of fuzzy numbers, and convexity with differentiability of fuzzy mappings, we have obtained the Fritz John (FJ) constraint qualificat...

متن کامل

Carathéodory–john-type Sufficiency Criteria in Continuous-time Nonlinear Programming under Generalized (α, Ρ)− (η, Θ)-type I Invexity

Continuous-time linear programming was first introduced by Bellman [1] in the treatment of production and inventory “bottleneck” problems. He formulated the dual problem, established a weak duality theorem and described sufficient optimality conditions. Tyndall [12] extended Bellman’s theory and obtained existence and duality theorems for a class of continuous linear programming problem. Levins...

متن کامل

New optimality conditions for multiobjective fuzzy programming problems

In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables.  Based on a new $p$-dimensional fuzzy stationary-point definition,  necessary  efficiency conditions are obtained.  And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003